Richard Stanley's Twelvefold Way

نویسندگان

  • Richard Stanley
  • Twelvefold Way
چکیده

Many combinatorial problems can be framed as counting the number of ways to allocate balls to urns, subject to various conditions. Richard Stanley invented the \twelvefold way" to organize these results into a table with twelve entries. See his book Enumerative Combinatorics, Volume 1. Let b represent the number of balls available and u the number of urns. The following table gives the number of ways to partition the balls among the urns according to the various states of labeled or unlabeled and subject to certain restrictions. The column headed \≤ 1" corresponds to requiring that there be no more than one ball in each urn. Similarly, the column headed \≥ 1" corresponds to requiring at least one ball in each urn.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Twelvefold Way

This entry provides all cardinality theorems of the Twelvefold Way. The Twelvefold Way [1, 5, 6] systematically classifies twelve related combinatorial problems concerning two finite sets, which include counting permutations, combinations, multisets, set partitions and number partitions. This development builds upon the existing formal developments [2, 3, 4] with cardinality theorems for those ...

متن کامل

Symmetric Function Generalizations of Graph Polynomials

Motivated by certain conjectures regarding immanants of Jacobi-Trudi matrices, Stanley has recently defined and studied a symmetric function generalization XG of the chromatic polynomial of a graph G. Independently, Chung and Graham have defined and studied a directed graph invariant called the cover polynomial. The cover polynomial is closely related to the chromatic polynomial and to the rook...

متن کامل

5 M ay 2 00 4 CYCLIC AND AUGMENTED DESCENTS

Louis Solomon showed that the group algebra of the symmetric group Sn has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has something which can be called a descent algebra. For any Coxeter group that is also a Weyl group, Paola Cellini proved the existence of a different, commutative subalgebra of...

متن کامل

Implementation of Stanley's algorithm for projective group imbeddings

Computing intersection cohomology Betti numbers is complicated by the fact that the usual long exact localization sequences in Borel–Moore homology do not carry over to the setting of intersection homology. Nevertheless, about 20 years ago, Richard Stanley had formulated a remarkable algorithm for computing the intersection cohomology Betti numbers of toric varieties. During the last few years,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009